منابع مشابه
Total Roman domination subdivision number in graphs
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
متن کاملon the total domatic number of regular graphs
a set $s$ of vertices of a graph $g=(v,e)$ without isolated vertex is a {em total dominating set} if every vertex of $v(g)$ is adjacent to some vertex in $s$. the {em total domatic number} of a graph $g$ is the maximum number of total dominating sets into which the vertex set of $g$ can be partitioned. we show that the total domatic number of a random $r$-regular graph is almost...
متن کاملThe Total Acquisition Number of Random Graphs
Let G be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex u to a neighbouring vertex v can be moved, provided that the weight on v is at least as large as the weight on u. The total acquisition number of G, denoted by at(G), is the minimum possible size of the set of vertices with positive weight at the end of the process. LeSaulnier, Prince, Wenger, W...
متن کاملTotal Domination number of Generalized Petersen Graphs
Generalized Petersen graphs are an important class of commonly used interconnection networks and have been studied . The total domination number of generalized Petersen graphs P(m,2) is obtained in this paper.
متن کاملTotal domination number of grid graphs
We use the link between the existence of tilings in Manhattan metric with {1}-bowls and minimum total dominating sets of Cartesian products of paths and cycles. From the existence of such a tiling, we deduce the asymptotical values of the total domination numbers of these graphs and we deduce the total domination numbers of some Cartesian products of cycles. Finally, we investigate the problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Network World
سال: 2017
ISSN: 1210-0552,2336-4335
DOI: 10.14311/nnw.2017.27.017